TWO ASPECTS OF A GENERALIZED FIBONACCI SEQUENCE

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$

In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.

متن کامل

Cycles in the Generalized Fibonacci Sequence modulo a Prime

Since their invention in the thirteenth century, Fibonacci sequences have intrigued mathematicians. As well as modeling the population patterns of overly energetic rabbits, however, they have sparked developments in more serious mathematics. For example, generalized Fibonacci sequences crop up in all manner of situations, from fiber optic networks [3] to computer algorithms [1] to probability t...

متن کامل

The Generating Function of the Generalized Fibonacci Sequence

Using tools of the theory of orthogonal polynomials we obtain the generating function of the generalized Fibonacci sequence established by Petronilho for a sequence of real or complex numbers {Qn}n=0 defined by Q0 = 0, Q1 = 1, Qm = ajQm 1 + bjQm 2, m ⌘ j (mod k), where k 3 is a fixed integer, and a0, a1, . . . , ak 1, b0, b1, . . . , bk 1 are 2k given real or complex numbers, with bj 6= 0 for 0...

متن کامل

Generalized Fibonacci recurrences and the lex-least De Bruijn sequence

The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographicallyleast de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and L...

متن کامل

The generalized order-k Fibonacci–Pell sequence by matrix methods

In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Indonesian Mathematical Society

سال: 2015

ISSN: 2460-0245,2086-8952

DOI: 10.22342/jims.21.1.173.1-17